Parallel LAN/WAN Heuristics for Optimization
نویسندگان
چکیده
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics (both pure and hybrid) for solving optimization problems. We focus on several evolutionary algorithms as well as on simulated annealing. Our goal is to offer a first study on the possible changes in the search mechanics that the algorithms suffer when shifting from a LAN network to a WAN environment. We will address six optimization tasks of considerable complexity. The results show that, despite their expected slower execution time, the WAN versions of our algorithms consistently solve the problems. We report also some interesting results in which WAN algorithms outperform LAN ones. Those results are further extended to analyze the behavior of the heuristics in WAN with a larger number of processors and different connectivities. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملA Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimisation Problems
In this paper, the Evolutionary Simulated Annealing (ESA) algorithm, its distributed implementation (dESA) and its application to two combinatorial problems are presented. ESA consists of a population, a simulated annealing operator, instead of the more usual reproduction operators used in evolutionary algorithms, and a selection operator. The implementation is based on a multi island (agent) s...
متن کاملA case study of Web server benchmarking using parallel WAN emulation
This paper describes the use of a parallel discrete-event network emulator called the Internet Protocol Traffic and Network Emulator (IP-TNE) for Web server benchmarking. The experiments in this paper demonstrate the feasibility of highperformance WAN emulation using parallel discrete-event simulation techniques on a single shared-memory multiprocessor. Our experiments with an Apache Web server...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملEfficient parallel LAN/WAN algorithms for optimization. The mallba project
The MALLBA project tackles the resolution of combinatorial optimization problems using generic algorithmic skeletons implemented in C++. A skeleton in the MALLBA library implements an optimization method in one of the three families of generic optimization techniques offered: exact, heuristic and hybrid. Moreover, for each of those methods, MALLBA provides three different implementations: seque...
متن کامل